Definable closure in randomizations
نویسندگان
چکیده
منابع مشابه
Definable closure in randomizations
The randomization of a complete rst order theory T is the complete continuous theory T with two sorts, a sort for random elements of models of T , and a sort for events in an underlying probability space. We give necessary and su cient conditions for an element to be de nable over a set of parameters in a model of T.
متن کاملSeparable Models of Randomizations
Every complete first order theory has a corresponding complete theory in continuous logic, called the randomization theory. It has two sorts, a sort for random elements of models of the first order theory, and a sort for events. In this paper we establish connections between properties of countable models of a first order theory and corresponding properties of separable models of the randomizat...
متن کاملQuery Significance in Databases via Randomizations
Many sorts of structured data are commonly stored in a multi-relational format of interrelated tables. Under this relational model, exploratory data analysis can be done by using relational queries. As an example, in the Internet Movie Database (IMDb) a query can be used to check whether the average rank of action movies is higher than the average rank of drama movies. We consider the problem o...
متن کاملDefinable Representations of Definable C Groups
Let G be a compact affine definable C group and let r be∞ or ω. We prove that the representative definable C functions on G is dense in the space of continuous functions on G. Moreover we compare the category of compact affine definable C groups D with that of compact real algebraic groups A.
متن کاملScattered Sentences Have Few Separable Randomizations
In the paper Randomizations of Scattered Sentences, Keisler showed that if Martin’s axiom for aleph one holds, then every scattered sentence has few separable randomizations, and asked whether the conclusion could be proved in ZFC alone. We show here that the answer is “yes”. It follows that the absolute Vaught conjecture holds if and only if every Lω1ω-sentence with few separable randomization...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2015
ISSN: 0168-0072
DOI: 10.1016/j.apal.2014.11.005